Extensions of Wilson ’ S Lemma and the Ax
نویسندگان
چکیده
Recently R. M. Wilson used Fleck’s congruence and Weisman’s extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck’s congruence given by D. Wan, and D. M. Davis and Z. W. Sun, we obtain new extensions of Wilson’s lemma and the Ax-Katz theorem.
منابع مشابه
Extensions of Wilson ’ S Lemma and the Ax - Katz Theorem
Recently R. M. Wilson used Fleck’s congruence and Weisman’s extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck’s congruence given by D. Wan, and D. M. Davis and ...
متن کاملLecture 14 : The Lovász Local Lemma and the Independence Polynomial
iff px ∈ [0, 1) for all x. When the events are not independent, an answer is given by the Lovász local lemma (and its variations). Definition 14.1. We say that G is the dependency graph of (Ax)x∈X if for all x ∈ X, Ax is independent of the σ-algebra generated by the collection {Ay | y / ∈ Γ∗(x)} (where Γ(x) is the set of neighbours of x in G and Γ∗(x) := Γ(x) ∪ {x}). Theorem 14.2 (Lovász local ...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملNon-Asymptotic Theory of Random Matrices Lecture 16: Invertibility of Gaussian Matrices and Compressible/Incompressible Vectors
We begin this lecture by asking why should an arbitrary n × n Gaussian matrix A be invertible? That is, does there exist a lower bound on the smallest singular value s n (A) = inf x∈S n−1 Ax 2 ≥ c √ n where c > 0 is an absolute constant. There are two reasons (or cases) which we will pursue in this lecture. 1. In Lecture 15 we saw that the invertibility of rectangular (i.e., non-square) Gaussia...
متن کامل